Improving Exhaustive Search Implies Superpolynomial Lower Bounds
نویسندگان
چکیده
منابع مشابه
Superpolynomial Lower Bounds for Monotone Span Programs
In this paper we obtain the first superpolynomial lower bounds for monotone span programs computing explicit functions. The best previous lower bound was Ω(n) by Beimel, Gál, Paterson [BGP]; our proof exploits a general combinatorial lower bound criterion from that paper. Our lower bounds are based on an analysis of Paley-type bipartite graphs via Weil’s character sum estimates. We prove an n n...
متن کاملSuperpolynomial Lower Bounds for Monotone Span Programs 1
In this paper we obtain the rst superpolynomial lower bounds for monotone span programs computing explicit functions. The best previous lower bound was (n5=2) by Beimel, G al, Paterson [BGP]; our proof exploits a general combinatorial lower bound criterion from that paper. Our lower bounds are based on an analysis of Paley-type bipartite graphs via Weil's character sum estimates. We prove an n ...
متن کاملExponential Lower Bounds for AC-Frege Imply Superpolynomial Frege Lower Bounds
We give a general transformation which turns polynomialsize Frege proofs to subexponential-size AC-Frege proofs. This indicates that proving exponential lower bounds for AC-Frege is hard, since it is a longstanding open problem to prove super-polynomial lower bounds for Frege. Our construction is optimal for tree-like proofs. As a consequence of our main result, we are able to shed some light o...
متن کاملA Exponential Lower Bounds for AC-Frege Imply Superpolynomial Frege Lower Bounds
We give a general transformation which turns polynomial-size Frege proofs to subexponential-size AC0Frege proofs. This indicates that proving truly exponential lower bounds for AC0-Frege is hard, since it is a longstanding open problem to prove super-polynomial lower bounds for Frege. Our construction is optimal for proofs of formulas of unbounded depth. As a consequence of our main result, we ...
متن کاملSuperpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree n in n variables such that any homogeneous depth 4 arithmetic circuit computing it must have size n . Our results extend the works of Nisan-Wigderson [NW95] (which showed superpolynomial lower bounds for homogeneous depth 3 circuits), Gup...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/10080703x